Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
نویسندگان
چکیده
We build on the classical greedy sequential set cover algorithm, in the spirit of the primal-dual schema, to obtain simple parallel approximation algorithms for the set cover problem and its generalizations. Our algorithms use randomization, and our randomized voting lemmas may be of independent interest. Fast parallel approximation algorithms were known before for set cover, though not for the generalizations considered in this paper.
منابع مشابه
Greedy Algorithms by Derandomizing Unknown Distributions
Simple strategies for large zero-sum games with applications to complexity theory. [16] Sridhar Rajagopalan and Vijay Vazirani. Primal-dual RNC approximation algorithms for (multi)-set (multi)-cover and covering integer programs.
متن کاملPrimal-dual RNC approximation algorithms for (multi)-set (multi)-cover and covering integer programs
We build on the classical greedy sequential set cover algorithm, in the spirit of the primal-dual schema, to obtain simple parallel approxima.tion algorithms for the set cover problem and its generalizations. Our algorithms use randomization, and our randomized voting lemmas may be of independent interest. Fast parallel approximation algorithms were known before for set cover [BRS89] [LN93], th...
متن کاملGreedy D{\ensuremath{\Delta}}-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost
This paper describes a greedy ∆-approximation algorithm for MONOTONE COVERING, a generalization of many fundamental NP-hard covering problems. The approximation ratio ∆ is the maximum number of variables on which any constraint depends. (For example, for vertex cover, ∆ is 2.) The algorithm unifies, generalizes, and improves many previous algorithms for fundamental covering problems such as ver...
متن کاملHow well can Primal-Dual and Local-Ratio algorithms
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is defined syntactically and without any complexity limitations and hence our approximation bounds are independent of the P vs NP question. We provide tools to bound the performance of primal dual and local ratio algorithm...
متن کاملHow well can Primal - Dual and Local - Ratio algorithms perform ? ∗ Allan
We define an algorithmic paradigm, the stack model, that captures many primal dual and local ratio algorithms for approximating covering and packing problems. The stack model is defined syntactically and without any complexity limitations and hence our approximation bounds are independent of the P vs NP question. Using the stack model, we bound the performance of a broad class of primal dual an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Comput.
دوره 28 شماره
صفحات -
تاریخ انتشار 1998